Reasoning Method between Polynomial Error Assertions

Error coefficients are ubiquitous in systems. In particular, errors reasoning verification must be considered regarding safety-critical We present a method that can applied to systems described by the polynomial error assertion (PEA). The implication relationship between PEAs converted an inclusion zero sets of PEAs; then transformed into first-order logic. Combined with quantifier elimination method, based on cylindrical algebraic decomposition, judgment is parameters and specific coefficient constraints, which obtained method. proposed validated proving related theorems. An example intercepting target objects provided, correctness our tested through large-scale random cases. Compared methods without semantics, has advantage being able deal parameters.